A note on kernels and Sperner's Lemma
نویسندگان
چکیده
The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni andHolzmangave a shorter proof. Bothproofswere based on Scarf’s Lemma. In this note we show that a very simple proof can be given using a polyhedral version of Sperner’s Lemma. In addition, we extend the Boros–Gurvich theorem to h-perfect graphs and to a more general setting. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Kernels, stable matchings, and Scarf's Lemma
Scarf's Lemma originally appeared as a tool to prove the non-emptiness of the core of certain NTU games. More recently, however, several applications have been found in the area of graph theory and discrete mathematics. In this paper we present and extend some of these applications. In particular, we prove results on the existence of kernels in orientations of h-perfect graphs. We describe a ne...
متن کاملOn a Lemma of Scarf
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics has already been demonstrated in [1], where it was used to prove the existence of fractional kernels in digraphs not containing cyclic triangles. We indicate some links of the lemma to other combinatorial results, both...
متن کاملFixed-Point Theorem, and Cohomology
1. INTRODUCTION. The proof of the Brouwer fixed-point Theorem based on Sperner's Lemma [S] is often presented as an elementary combi-natorial alternative to advanced proofs based on algebraic topology. See, for example, Section 6.3 of [P1]. One may ask if this proof is really based on ideas completely different from the ideas of algebraic topology (and, in particular, the ideas of Brouwer's own...
متن کاملComplexity of Scarf’s Lemma and Related Problems
Scarf’s lemma is one of the fundamental results in combinatorics, originally introduced to study the core of an N -person game. Over the last four decades, the usefulness of Scarf’s lemma has been demonstrated in several important combinatorial problems seeking stable solutions ([12], [1] [2], [15]). However, the complexity of the computational version of Scarf’s lemma (Scarf) remained open. In...
متن کاملA Generalization of Sperner's Theorem on Compressed Ideals
Let [n] = {1, 2, . . . , n} and Bn = {A : A ⊆ [n]}. A family A ⊆ Bn is a Sperner family if A * B and B * A for distinct A,B ∈ A . Sperner’s theorem states that the density of the largest Sperner family in Bn is ( n dn/2e ) /2n. The objective of this note is to show that the same holds if Bn is replaced by compressed ideals over [n].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009